OpenCL Implementation of PSO Algorithm for the Quadratic Assignment Problem
نویسندگان
چکیده
This paper presents a Particle Swarm Optimization (PSO) algorithm for the Quadratic Assignment Problem (QAP) implemented on OpenCL platform. Motivations to our work were twofold: firstly we wanted to develop a dedicated algorithm to solve the QAP showing both time and optimization performance, secondly we planned to check, if the capabilities offered by popular GPUs can be exploited to accelerate hard optimization tasks requiring high computational power. We were specifically targeting low-cost popular devices, with limited capabilities. The paper discusses the algorithm and its parallel implementation, as well as reports results of tests.
منابع مشابه
Multi-swarm PSO algorithm for the Quadratic Assignment Problem: a massively parallel implementation on the OpenCL platform
This paper presents a multi-swarm PSO algorithm for the Quadratic Assignment Problem 1 (QAP) implemented on the OpenCL platform. Our work was motivated by results of time efficiency 2 tests performed for single-swarm algorithm implementation that showed clearly that the benefits of a 3 parallel execution platform can be fully exploited provided the processed population is large. The 4 described...
متن کاملMulti-swarm PSO algorithm for the Quadratic Assignment Problem: a massive parallel implementation on the OpenCL platform
This paper presents a multi-swarm PSO algorithm for the Quadratic Assignment Problem (QAP) implemented on OpenCL platform. Our work was motivated by results of time efficiency tests performed for singleswarm algorithm implementation that showed clearly that the benefits of a parallel execution platform can be fully exploited, if the processed population is large. The described algorithm can be ...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملParticle Swarm Optimization For Quadratic Assignment Problems–A Forma Analysis Approach
Particle Swarm Optimization (PSO) is an innovative and competitive optimization technique for numerical optimization with real-parameter representation. This paper examines the working mechanism of PSO in a principled manner with forma analysis and investigates the applicability of PSO on the Quadratic Assignment Problem (QAP). Particularly, the derived PSO operator for QAP is empirically studi...
متن کاملOffering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem
Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...
متن کامل